Perfect Line Domination in Graphs
نویسندگان
چکیده
منابع مشابه
Roman domination perfect graphs
A Roman dominating function on a graphG is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u ∈ V (G) for which f(u) = 0 is adjacent to at least one vertex v ∈ V (G) for which f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The Roman domination number γR(G) of G is the minimum weight of a Roman dominating function on G. A Ro...
متن کاملPerfect k-domination in graphs
Let k be a positive integer. A vertex subset D of a graph G = (V,E) is a perfect k-dominating set of G if every vertex v of G, not in D, is adjacent to exactly k vertices of D. The minimum cardinality of a perfect k-dominating set of G is the perfect k-domination number γkp(G). In this paper, we generalize perfect domination to perfect k-domination, where many bounds of γkp(G) are obtained. We ...
متن کاملUnique domination and domination perfect graphs
We review a characterization of domination perfect graphs in terms of forbidden induced subgraphs obtained by Zverovich and Zverovich [12] using a computer code. Then we apply it to a problem of unique domination in graphs recently proposed by Fischermann and Volkmann. 1 Domination perfect graphs Let G be a graph. A set D ⊆ V (G) is a dominating set of G if each vertex of G either belongs to D ...
متن کاملPerfect edge domination and efficient edge domination in graphs
Let G = (V; E) be a /nite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of E is called a perfect edge dominating set if every edge of E \ D is dominated by exactly one edge in D and an e cient edge dominating set if every edge of E is dominated by exactly one edge in D. The perfect (e cient) edge domination prob...
متن کاملPerfect domination in rectangular grid graphs
A dominating set S in a graph G is said to be perfect if every vertex of G not in S is adjacent to just one vertex of S. Given a vertex subset S of a side Pm of an m×n grid graph G, the perfect dominating sets S in G with S = S ∩ V (Pm) can be determined via an exhaustive algorithm Θ of running time O(2m+n). Extending Θ to infinite grid graphs of width m − 1, periodicity makes the binary decisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Applied Electronics
سال: 2017
ISSN: 2394-4714
DOI: 10.5120/cae2017652705